An Explanation of Splaying

نویسنده

Ashok Subramanian

چکیده

Just as in bottom-up splaying, the idea is to follow each access by a restructuring of the search tree along the path from the accessed item to the root of the tree. The restructuring is done in a local fashion, i.e., without using information about the global structure of the tree. We call the restructuring algorithm the super̈ isor; it operates with a set of rules called the ruleset. Each unit of restructuring happens in the vicinity of the cursor, a distinguished location in the search tree. Initially the supervisor places the cursor at the location of the item that has just been accessed. It then repeatedly picks an applicable rule from the ruleset and applies it. Each rule application moves the cursor toward the root of the search tree. Eventually the cursor reaches the root of the search tree, and the supervisor halts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rehabilitation of an unloved child: semi-splaying

Splay trees are widely considered as the classic examples of self-adjusting binary search trees and are part of probably every course on data structures and algorithms. Already in the first seminal paper on splay trees [7] alternative operations were introduced, among which semi-splaying. On the one hand the analysis of semi-splaying gives a smaller constant for the amortized complexity, howeve...

متن کامل

A Systematic Analysis of Splaying

In this paper we perform an amortized analysis of a functional program for splaying. We construct a potential function that yields the same bound for the amortized cost of splaying as given by D.D. Sleator and R.E. Tarjan—the inventors of splay trees. In addition, we show that this bound is minimal for the class of “sum of logs” potentials. Our approach also applies to the analysis of path reve...

متن کامل

Central Macular Splaying and Outer Retinal Thinning in Asymptomatic Sickle Cell Patients by Spectral Domain Optical Coherence Tomography Short Title: Macular Splaying and Outer Retinal Thinning in Sickle Cell

متن کامل

Concurrent Search Tree by Lazy Splaying

In many search tree (maps) applications the distribution of items accesses is non-uniform, with some popular items accessed more frequently than others. Traditional self-adjusting tree algorithms adapt to the access pattern, but are not suitable for a concurrent setting since they constantly move items to the tree’s root, turning the root into a sequential hot spot. Here we present lazy splayin...

متن کامل